The existence of square non-integer Heffter arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Square integer Heffter arrays with empty cells

A Heffter array H(m,n; s, t) is an m× n matrix with nonzero entries from Z2ms+1 such that i) each row contains s filled cells and each column contains t filled cells, ii) every row and column sum to 0, and iii) no element from {x,−x} appears twice. Heffter arrays are useful in embedding the complete graph K2nm+1 on an orientable surface where the embedding has the property that each edge border...

متن کامل

Heffter Arrays and Biembedding Graphs on Surfaces

A Heffter array is an m× n matrix with nonzero entries from Z2mn+1 such that i) every row and column sum to 0, and ii) exactly one of each pair {x,−x} of nonzero elements appears in the array. We construct some Heffter arrays. These arrays are used to build current graphs used in topological graph theory. In turn, the current graphs are used to embed the complete graph K2mn+1 so that the faces ...

متن کامل

Multiplicities of Integer Arrays

We prove a general theorem about the multiplicity of the entries in certain integer arrays which is best possible in general. As an application we give non-trivial bounds for the multiplicities of several well-known combinatorial arrays including the binomial coefficients, Narayana numbers and the Eulerian numbers. For the binomial coefficients we obtain the result of Singmaster.

متن کامل

Square function and Riesz transform in non-integer dimensions

Following a recent paper [10] we show that the finiteness of square function associated with the Riesz transforms with respect to Hausdorff measure H implies that s is integer.

متن کامل

Implementation of Integer Square Root

Square root plays a major role in applications like computer graphics, image processing. To increase the performance of computation, many algorithms have been proposed to carry out the computation task in hardware instead of software. One very common and relatively quick method for finding the square root of a number is the Newton-Raphson method which requires extensive use of division to produ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2019

ISSN: 1855-3974,1855-3966

DOI: 10.26493/1855-3974.1817.b97